#include<bits/stdc++.h>
#define ONLINE_JUDGE
#define ll long long
#define ull unsigned long long
using namespace std;

const int N = 10, INF = 0x3f3f3f3f;
struct node {
    pair<int, int> u, v;
    double d;
};

int n;
double ans = INF, s, t;
vector<node> g;
bool vis[N];

double dist(pair<int, int> a, pair<int, int> b) { return  sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2)); }

void dfs(pair<int, int> pre, int cnt, double sum)
{
    if (cnt == n) {
        ans = min(ans, sum);
        return;
    }
    for (int i = 0;i < n;i++) {
        if (vis[i]) continue;
        vis[i] = 1;
        double temp = sum + dist(pre, g[i].u) / s + g[i].d / t;
        dfs(g[i].v, cnt + 1, temp);
        temp = sum + dist(pre, g[i].v) / s + g[i].d / t;
        dfs(g[i].u, cnt + 1, temp);
        vis[i] = 0;
    }
}

void solve()
{
    cin >> n >> s >> t;
    for (int i = 1;i <= n;i++) {
        pair<int, int> a, b;
        cin >> a.first >> a.second >> b.first >> b.second;
        g.push_back({ a,b ,dist(a,b) });
    }
    dfs({ 0,0 }, 0, 0);
    cout << fixed << setprecision(6);
    cout << ans;
}

signed main()
{
    // ios::sync_with_stdio(0);
    // cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
    std::istringstream in(R"()");
    std::cin.rdbuf(in.rdbuf());
#endif
    int T = 1;
    //cin>>T;
    for (int i = 1;i <= T;i++) {
        solve();
}
}